The Polymatrix Gap Conjecture
نویسندگان
چکیده
This paper proposes a novel way to compare classes of strategic games based on their sets pure Nash equilibria. approach is then used relate the zero-sum games, polymatrix, and k-polymatrix games. concludes with conjecture that form an increasing chain classes.
منابع مشابه
The Three Gap Theorem (Steinhauss Conjecture)
We deal with the distribution of N points placed consecutively around the circle by a fixed angle of α. From the proof of Tony van Ravenstein [RAV88], we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N points partition the circle into gaps of at most three different lengths. We study the mathematical notions required for the proof of this theorem reveal...
متن کاملOut(Fn) AND THE SPECTRAL GAP CONJECTURE
For n > 2, given φ1, . . . , φn randomly chosen isometries of S, it is well-known that the group Γ generated by φ1, . . . , φn acts ergodically on S. It is conjectured in [GJS] that for almost every choice of φ1, . . . , φn this action is strongly ergodic. This is equivalent to the spectrum of φ1 +φ1 −1 + · · ·+φn +φ n as an operator on L(S) having a spectral gap, i.e. all eigenvalues but the l...
متن کاملThe Three Gap Theorem (Steinhaus Conjecture)
We deal with the distribution of N points placed consecutively around the circle by a fixed angle of α. From the proof of Tony van Ravenstein [RAV88], we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N points partition the circle into gaps of at most three different lengths. We study the mathematical notions required for the proof of this theorem reveal...
متن کاملThe Fundamental Gap Conjecture for Polygonal Domains
In [22], M. van de Berg made a “fundamental gap conjecture” in the context of a free boson gas confined in a container in Rn with hard walls, and in [24], Yau generalized the conjecture to what is now known as the “fundamental gap conjecture.” For a convex domain Ω ⊂ Rn, (0.1) ξ(Ω) := d (λ2(Ω)− λ1(Ω)) ≥ 3π where d is the diameter of the domain, and 0 < λ1(Ω) < λ2(Ω) are the first two eigenvalue...
متن کاملProof of Aldous’ Spectral Gap Conjecture
Aldous’ spectral gap conjecture asserts that on any graph the random walk process and the random transposition (or interchange) process have the same spectral gap. We prove the conjecture using a recursive strategy. The approach is a natural extension of the method already used to prove the validity of the conjecture on trees. The novelty is an idea based on electric network reduction, which re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Game Theory Review
سال: 2021
ISSN: ['1793-6675', '0219-1989']
DOI: https://doi.org/10.1142/s0219198922500050